A Note on Bahadur's Transitivity

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the transitivity of parthood

That parthood is a transitive relation is among the most basic principles of classical mereology. Alas, it is also very controversial. In a recent paper, Ingvar Johansson has put forward a novel diagnosis of the problem, along with a corresponding solution. The diagnosis is on the right track, I argue, but the solution is misleading. And once the pieces are properly put together, we end up with...

متن کامل

A note on the transitivity of step-indexed logical relations

We present and discuss a simple semantic approach to force step-indexed logical relations to be transitive.

متن کامل

A Note on Incompleteness, Transitivity and Suzumura Consistency

Rationality does not require of preferences that they be complete. Nor therefore that they be transitive: Suzumura consistency suffi ces. This paper examines the implications of these claims for the theory of rational choice. I propose a new choice rule Strong Maximality and argue that it better captures rational preference-based choice than other more familiar rules. Suzumura consistency of pr...

متن کامل

A Note on Transitivity, Completeness and Suzumura Consistency

What is required of the agent who makes her choices on the basis of her preferences? What can be inferred about an agent’s preferences from the choices she makes? In considering these questions, it is worth distinguishing between the choices that are permissable given her preferences, those that are mandatory and those that she actually makes. Rationality does not generally require that agents ...

متن کامل

A Note on Vertex Transitivity in Isomorphic Graphs

In the graph theory, two graphs are said to be isomorphic if there is a one-one, onto mapping defined between their set of vertices so as to preserving the adjacency between vertices. An isomorphism defined on a vertex set of a graph to itself is called automorphism of the given graph. Two vertices in a graph are said to be similar if there is an automorphism defined on its vertex set mapping o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Statistics

سال: 1993

ISSN: 0090-5364

DOI: 10.1214/aos/1176349417